List Homomorphic Parallel Algorithms for Bracket Matching
نویسنده
چکیده
We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the practical eecacy with which such algorithms can be derived and expressed given the support of a well understood theoretical foundation. One of the variants produced is of particular interest in that it exploits the same theoretical result twice to produce nested parallelism.
منابع مشابه
Calculating an Optimal Homomorphic Algorithm for Bracket Matching
It is widely recognized that a key problem of parallel computation is in the development of both e cient and correct parallel software. Although many advanced language features and compilation techniques have been proposed to alleviate the complexity of parallel programming, much e ort is still required to develop parallelism in a formal and systematic way. In this paper, we intend to clarify t...
متن کاملEfficient EREW PRAM Algorithms for Parentheses-Matching
We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing ~1 parentheses. Although this algorit...
متن کاملSecure License Plate Matching using Homomorphic Encryption
License plate matching plays an important role in applications like law enforcement and road pricing where the plate is first recognized and then compared to a database of authorized vehicle plates. If an entity with a license plate wants to find a match in the license plates database which is in the possession of another entity; matching in the encrypted domain ensures that the privacy of data...
متن کاملEfficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design
Parallel computing has become one of the major areas of research in the computer science field with numerous journals and conferences dedicated to its development. Multiprocessor computers (parallel computers) are becoming more prevalent, with several manufacturers and models readily available, several at quite low prices. However, while the hardware is progressing rapidly, the methodologies an...
متن کاملHCL: A Language for Low-Level Image Analysis
Pyramids have received a great deal of interest as a data structure for use in hierarchical computer vision. This paper describes a language for the description of pyramid algorithms, supporting conceptually parallel pattern-matching and arithmetic operations. The language is defined by adding constructs from a notation for pyramid algorithms called Hierarchical Cellular Logic to the general-pu...
متن کامل